Several identities involving the Fibonacci polynomials and Lucas polynomials

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Binomial Identities Involving The Generalized Fibonacci Type Polynomials

We present some binomial identities for sums of the bivariate Fi-bonacci polynomials and for weighted sums of the usual Fibonacci polynomials with indices in arithmetic progression.

متن کامل

Generalized Fibonacci and Lucas Polynomials and Their Associated Diagonal Polynomials

Horadam [7], in a recent article, defined two sequences of polynomials Jn(x) and j„(x), the Jacobsthal and Jacobsthal-Lucas polynomials, respectively, and studied their properties. In the same article, he also defined and studied the properties of the rising and descending polynomials i^(x), rn(x), Dn(x)y and dn(x), which are fashioned in a manner similar to those for Chebyshev, Fermat, and oth...

متن کامل

On Bivariate Complex Fibonacci and Lucas Polynomials

In this study we define and study the Bivariate Complex Fibonacci and Bivariate Complex Lucas Polynomials. We give generating function, Binet formula, explicit formula and partial derivation of these polynomials. By defining these bivariate polynomials for special cases Fn(x, 1) is the complex Fibonacci polynomials and Fn(1, 1) is the complex Fibonacci numbers. Finally in the last section we gi...

متن کامل

On convolved generalized Fibonacci and Lucas polynomials

We define the convolved hðxÞ-Fibonacci polynomials as an extension of the classical con-volved Fibonacci numbers. Then we give some combinatorial formulas involving the hðxÞ-Fibonacci and hðxÞ-Lucas polynomials. Moreover we obtain the convolved hðxÞ-Fibo-nacci polynomials from a family of Hessenberg matrices. Fibonacci numbers and their generalizations have many interesting properties and appli...

متن کامل

Some Trigonometric Identities Involving Fibonacci and Lucas Numbers

In this paper, using the number of spanning trees in some classes of graphs, we prove the identities: Fn = 2n−1 n √

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Inequalities and Applications

سال: 2013

ISSN: 1029-242X

DOI: 10.1186/1029-242x-2013-205